Approximation Algorithm for the Max k-CSP Problem
نویسندگان
چکیده
We present a ck 2k approximation algorithm for the Max k-CSP problem (where c > 0.44 is an absolute constant). This result improves the previously best known algorithm by Hast, which has an approximation guarantee of Ω( k 2k log k ). Our approximation guarantee matches the upper bound of Samorodnitsky and Trevisan up to a constant factor (their result assumes the Unique Games Conjecture).
منابع مشابه
Beating a Random Assignment : Approximating Constraint Satisfaction Problems
An instance of a Boolean constraint satisfaction problem, CSP, consists of a set of constraints acting over a set of Boolean variables. The objective is to find an assignment to the variables that satisfies all the constraints. In the maximization version, Max CSP, each constraint has a weight and the objective is to find an assignment such that the weight of satisfied constraints is maximized....
متن کاملAn Improvement to an Approximation Algorithm for Max k-CSP(d) REU Report
In this technical report, we present a slight improvement to an algorithm for the Max k-CSP(d) problem, the maximum constraint satisfaction problem with at most k variables in a clause and a domain of size d. The base of the algorithm is that of Makarychev and Makarychev [4]. As noted in their paper, their algorithm is efficient in the domain where k ≥ Ω(log d). Here we present an approach that...
متن کاملPositive Linear Programming, Parallel Approximation and PCP's
Several sequential approximation algorithms are based on the following paradigm: solve a linear or semideenite programming relaxation , then use randomized rounding to convert fractional solutions of the relaxation into integer solutions for the original combinatorial problem. We demonstrate that such a paradigm can also yield parallel approximation algorithms by showing how to convert certain ...
متن کاملRuling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables that maximises the number of satis ed constraints. Max CSP captures many well-known problems (such as Max k-SAT and Max Cut) and so is NP-hard in general. It is natural to study how ...
متن کاملApproximation Algorithm for Non-boolean MAX k-CSP
In this paper, we present a randomized polynomial-time approximation algorithm for MAX k-CSPd. In MAX k-CSPd, we are given a set of predicates of arity k over an alphabet of size d. Our goal is to find an assignment that maximizes the number of satisfied constraints. Our algorithm has approximation factor Ω(kd/d) (when k ≥ Ω(log d)). This bound is asymptotically optimal assuming the Unique Game...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 13 شماره
صفحات -
تاریخ انتشار 2006